Substitutable choice functions and convex geometry
نویسندگان
چکیده
منابع مشابه
Convex Functions and Spacetime Geometry
Convexity and convex functions play an important role in theoretical physics. To initiate a study of the possible uses of convex functions in General Relativity, we discuss the consequences of a spacetime (M, gμν) or an initial data set (Σ, hij , Kij) admitting a suitably defined convex function. We show how the existence of a convex function on a spacetime places restrictions on the properties...
متن کاملChoice functions and abstract convex geometries *
A main aim of this paper is to make connections between two well – but up to now independently – developed theories, the theory of choice functions and the theory of closure operators. It is shown that the classes of ordinally rationalizable and path independent choice functions are related to the classes of distributive and anti-exchange closures. 1999 Elsevier Science B.V. All rights reserved.
متن کاملThe convex geometry of consistent belief functions
In this paper we extend the geometric approach to belief functions to the case of consistent belief functions, i.e. belief functions whose plausibility function is a possibility measure, as a step towards a unified geometric picture of a wider class of fuzzy measures. We prove that, analogously to consonant belief functions, they form a simplicial complex (a structured collection of simplices) ...
متن کاملPiecewise Polynomial Functions, Convex Polytopes and Enumerative Geometry
0. Introduction. This paper explores some of the connections between the objects of its title. It is based on a new approach to McMullen’s polytope algebra, and on its relation with equivariant cohomology of toric varieties. In particular, we give another proof of a recent result of Fulton and Sturmfels, which identifies the polytope algebra with the direct limit of all Chow rings of smooth, co...
متن کاملDual greedy polyhedra, choice functions, and abstract convex geometries
We consider a system of linear inequalities and its associated polyhedron for which we can maximize any linear objective function by /nding tight inequalities at an optimal solution in a greedy way. We call such a system of inequalities a dual greedy system and its associated polyhedron a dual greedy polyhedron. Such dual greedy systems have been considered by Faigle and Kern, and Kr1 uger for ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 2015
ISSN: 0166-218X
DOI: 10.1016/j.dam.2015.01.028